Refinement Patterns for Contractual Statecharts
نویسنده
چکیده
The strategic goal of this project is to improve the theoretical bases and corresponding tool support for the design languages and methodologies that are widely used for building avionics and aerospace systems. Existing languages, particularly the popular Stateflow statecharts, lack in expressiveness and tool support for refinement-based designs as practised by engineers. In particular, they have no support for declarative styles of specification used at early design stages, and their semantics do not entirely benefit from the existing wealth of research on concurrent systems and semantics in component–based design. The specific novel contributions of this proposed research project are:
منابع مشابه
Towards Controlling Refinements of Statecharts
In incremental development strategies, modelers frequently refine Statecharts models to satisfy requirements and changes. Although several solutions exist to the problem of Statecharts refinement, they provide such levels of freedom that a statechart cannot make assumptions or guarantees about its future structure. In this paper, we propose a set of bounding rules to limit the allowable Statech...
متن کاملFrom MSCs to Statecharts
Message Sequence Charts (MSCs) have gained wide acceptance for scenario-based specifications of component behavior (see, for instance, [IT96, BMR+96, Rat97, BHKS97]). In particular, they have proven useful in the requirements capture phase of the software development process. However, up to now, most development methods do not assign a precise meaning to this graphical description technique. Mo...
متن کاملExploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers
Statecharts are frequently used as a modeling formalism in the design of state-based systems. Formal verification techniques are also often applied to prove certain properties about the behavior of the system. One of the most efficient techniques for formal verification is Counterexample-Guided Abstraction Refinement (CEGAR), which reduces the complexity of systems by automatically building and...
متن کاملLogic and refinement for charts
We introduce a logic for reasoning about and constructing refinements for μ-Charts, a rational simplification and reconstruction of Statecharts. The method of derivation of the logic is that a semantics for the language is constructed in Z and the existing logic and refinement calculus of Z is then used to induce the logic and refinement calculus of μ-Charts, proceeding by a series of definitio...
متن کاملA Process Algebraic Semantics for Statecharts via State Refinement
We give a formal semantics for statecharts via a translation into a process algebra with state reenement, a new operator for capturing hierarchy in concurrent systems. Our main technical result can be stated as follows. Let A be a statechart automaton as deened by the operational model of A. Pnueli and M. Shalev, What is in a step: On the semantics of statecharts, LNCS number 526, 1991], and le...
متن کامل